Low-complexity Graph Sampling With Noise and Signal Reconstruction via Neumann Series
نویسندگان
چکیده
منابع مشابه
Gibbs Sampling for Signal Reconstruction
This paper describes the use of stochastic simulation techniques to reconstruct biomedical signals not directly measurable. In particular, a deconvolution problem with an uncertain clearance parameter is considered. The problem is addressed using a Monte Carlo Markov Chain method, called the Gibbs Sampling, in which the joint posterior probability distribution of the stochastic parameters is es...
متن کاملComplexity Results in Graph Reconstruction
We investigate the relative complexity of the graph isomorphism problem (GI) and problems related to the reconstruction of a graph from its vertex-deleted or edge-deleted subgraphs (in particular, deck checking (DC) and legitimate deck (LD) problems). We show that these problems are closely related for all amounts c ≥ 1 of deletion: 1. GI ≡iso VDCc, GI ≡iso EDCc, GI ≤m LVDc, and GI ≡iso LEDc. 2...
متن کاملEnhancement of Noise Performance in Digital Receivers by Over Sampling the Received Signal
In wireless channel the noise has a zero mean. This channel property can be used in the enhancement of the noise performance in the digital receivers by oversampling the received signal and calculating the decision variable based on the time average of more than one sample of the received signal. The averaging process will reduce the effect of the noise in the decision variable that will approa...
متن کاملReconstruction from Randomized Graph via Low Rank Approximation
The privacy concerns associated with data analysis over social networks have spurred recent research on privacypreserving social network analysis, particularly on privacypreserving publishing of social network data. In this paper, we focus on whether we can reconstruct a graph from the edge randomized graph such that accurate feature values can be recovered. In particular, we present a low rank...
متن کاملGraph Sparsification via Refinement Sampling
A graph G(V,E) is an ǫ-sparsification of G for some ǫ > 0, if every (weighted) cut in G is within (1 ± ǫ) of the corresponding cut in G. A celebrated result of Benczúr and Karger shows that for every undirected graph G, an ǫ-sparsification with O(n log n/ǫ) edges can be constructed in O(m log n) time. The notion of cut-preserving graph sparsification has played an important role in speeding up ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2019
ISSN: 1053-587X,1941-0476
DOI: 10.1109/tsp.2019.2940129